Current Issue : October-December Volume : 2022 Issue Number : 4 Articles : 5 Articles
Shishuoxinyu is a collection of anecdotal stories about the words and deeds of Wei and Jin characters. In this paper, we build a complex network with characters in Shishuoxinyu to analyze the scholarly connections in the Wei-Jin and North-South dynasties. The ER random graph, WS small-world network, BA scale-free network, and experimental network are constructed for comparison. The network properties of the experimental network were analyzed using the average degree, average clustering coefficient, and average path length. Degree centrality, mesoscopic centrality, and proximity centrality were selected to understand the importance of the experimental network nodes, and it was found that the king guide had the highest importance in the whole experimental network. Then, through the observation of network degree distribution, this experimental network is considered as a scale-free network with robustness and vulnerability, which is in line with the political characteristics of the Wei-Jin and Northern Dynasties. Finally, ten larger- scale Shi clans are selected to construct a new network for inter-clan linkage analysis. This study helps to uncover the reasons for the rise and fall of the Shi clans during the Wei-Jin and North-South dynasties....
As an effective network protection method, computer user behavior anomaly detection can detect unknown attack behaviors. In order to detect user behavior anomalies more efficiently, the authors propose a computer user behavior anomaly detection model based on the K-means algorithm. According to the actual characteristics of single-user behavior, the algorithm uses sliding time window to define transactions and uses the first location strategy to mine behavior patterns. On this basis, the fault-tolerant mode is adopted to compare the current behavior mode with the normal behavior mode, and the anomaly detection results are obtained. Experiments show that using data mining technology, the association rules of user commands, and the mining of sequence patterns, it can effectively discover the user’s behavior pattern, and using sequence matching algorithms such as recursive correlation functions and calculating the similarity between the user’s historical pattern and the current pattern, it provides the possibility to accurately judge user behavior. The following conclusions are obtained through experiments: the model training time is short, the accuracy is high, and it has certain robustness....
In recent years, the demand for Wireless Sensor Network (WSN) in smart farming has had a tremendous increase in demand for its efficiency. Wireless sensor networks have very many nodes, and it is of no use when the battery dies. This is why there are several routing protocols being take into consideration to cub this problem. In this paper, in order to increase the heterogeneity and energy levels of the network, the M-LEACH protocol is proposed. The key aim of the Leach protocol is to prolong the existence of wireless sensor network by lowering the energy consumption needed for Cluster Head creation and maintenance, the proposed algorithm instructs a node to use high power amplification as it acts as the Cluster heads, and low power amplification when it becomes a Cluster Member, in the next stage. Finally, for better effectiveness, M-LEACH employs hard and soft threshold systems. Since it eliminates collisions and reduces the packet drop ratio for other signals, the M-LEACH protocol proposed works better than the Leach protocol....
As a promising solution, virtualization is vigorously developed to eliminate the ossification of traditional Internet infrastructure and enhance the flexibility in sharing the substrate network (SN) resources including computing, storage, bandwidth, etc. With network virtualization, cloud service providers can utilize the shared substrate resources to provision virtual networks (VNs) and facilitate a wide and diverse range of applications. As more and more internet applications migrate to the cloud, the resource efficiency and the survivability of VNs, such as single link failure or large-scale disaster survivability, have become crucial issues. Elastic optical networks have emerged in recent years as a strategy for dealing with the divergence of network application bandwidth needs. The network capacity has been constrained due to the usage of only two multiplexing dimensions. As transmission rates rise, so does the demand for network failure protection. Due to their end-to-end solutions, those safeguarding paths are of particular importance among the protection methods. Due to their end-to-end solutions, those safeguarding paths are of particular importance among the protection methods. This paper presents approaches that provide a failure-independent route-protecting p-cycle for path protection in space-division multiplexed elastic optical networks. This letter looks at two SDM network challenges and presents a heuristic technique (k-shortest path) for each. In the first approach, we study a virtual network embedding (SVNE) problem and propose an algorithm for EONs, which can combat against single-link failures. We evaluate the proposed POPETA algorithm and compare its performance with some counterpart algorithms. Simulation results demonstrate that the proposed algorithm can achieve satisfactory performance in terms of spectrum utilization and blocking ratio, even if with a higher backup redundancy ratio....
The next-generation wireless LAN standard named IEEE 802.11be supports a multilink operation to cost-efficiently boost throughput performance, for which an efficient multilink channel scheme is essential. The synchronous channel access scheme with an enhancement allowing multilink transmission before backoff completion greatly enhances the performance of multilink devices with no simultaneous transmit and receive capability, for which, however, backoff count compensation is necessary for coexistence with legacy and other multilink devices. In this paper, we identify the backoff count overflow problem of the enhanced synchronous channel access scheme with backoff compensation, which becomes aggravated once triggered due to repeated compensations. Then, we propose four solutions to mitigate this problem: limiting consecutive free-riding transmissions, limiting a compensated backoff value, using the contention window value of a main link, and balancing transmissions between links. Through comparative evaluation and analyses for dense single-spot and indoor random deployment scenarios, we demonstrate in terms of throughput and latency that the proposed solutions successfully mitigate the problem while preserving the coexistence performance....
Loading....